Bypass rates: reducing query abandonment using negative inferences
Atish Das Sarma
Sreenivas Gollapudi
Samuel Ieong
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are <i>bypassed</i>-documents returned higher in the ordering of the search results but skipped by the user. This approach complements the popular click-through rate analysis, and helps to draw <i>negative inferences</i> in the click logs. We formulate a natural objective that finds sets of results that are unlikely to be collectively bypassed by a typical user. This is closely related to the problem of reducing <i>query abandonment</i>. We analyze a greedy approach to optimizing this objective, and establish theoretical guarantees of its performance. We evaluate our approach on a large set of queries, and demonstrate that it compares favorably to the <i>maximal marginal relevance</i> approach on a number of metrics including <i>mean average precision</i> and <i>mean reciprocal rank</i>.
